The least k-th power non-residue
نویسنده
چکیده
Let p be a prime number and let k ≥ 2 be an integer such that k divides p − 1. Norton proved that the least k-th power non-residue modp is at most 3.9p log p unless k = 2 and p ≡ 3 (mod 4), in which case the bound is 4.7p log p. With a combinatorial idea and a little help from computing power, we improve the upper bounds to 0.9p log p and 1.1p log p, respectively.
منابع مشابه
THE LEAST QUADRATIC NON-RESIDUE, VALUES OF L-FUNCTIONS AT s = 1, AND RELATED PROBLEMS
In this paper, we study explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic non-residue and the least prime in an arithmetic progression. We also refine the classical conditional bounds of Littlewood for L-functions at s = 1. In part...
متن کاملConditional bounds for the least quadratic non-residue and related problems
This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic non-residue and the least prime in an arithmetic progression. We also refine the classical conditional bounds of Littlewood for L-functions at s = 1. In particula...
متن کاملDistinguishing number and distinguishing index of natural and fractional powers of graphs
The distinguishing number (resp. index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (resp. edge labeling) with $d$ labels that is preserved only by a trivial automorphism. For any $n in mathbb{N}$, the $n$-subdivision of $G$ is a simple graph $G^{frac{1}{n}}$ which is constructed by replacing each edge of $G$ with a path of length $n$...
متن کاملPairs of Consecutive Power Residues
Introduction. Until recently none of the numerous papers on the distribution of quadratic and higher power residues was concerned with questions of the following sort: Let k and m be positive integers. According to a theorem of Brauer (1), for every sufficiently large prime p there exist m consecutive positive integers r, r + l , . . . , r + m — 1, each of which is a &th power residue of p. Let...
متن کاملSimple Arguments on Consecutive Power Residues
By some extremely simple arguments, we point out the following: (i) If n is the least positive kth power non-residue modulo a positive integer m, then the greatest number of consecutive kth power residues mod m is smaller than m/n. (ii) Let OK be the ring of algebraic integers in a quadratic field K = Q( √ d) with d ∈ {−1,−2,−3,−7,−11}. Then, for any irreducible π ∈ OK and positive integer k no...
متن کامل